Ore Polynomials in Sage
نویسندگان
چکیده
We present a Sage implementation of Ore algebras. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing; desingularization; solvers for polynomials, rational functions and (generalized) power series. This paper is a tutorial on how to use the package.
منابع مشابه
Ore Subresultants in Solutions
The subresultants play a fundamental role in elimination theory and computer algebra. Recently they have been extended to Ore polynomials. They are de ̄ned by an expression in the coe±cients of Ore polynomials. In this paper, we provide another expression for them. This expression is written in terms of the \solutions" of Ore polynomials (in \generic" case). It is a generalization of our previou...
متن کاملMultivariate Polynomials in Sage
We have developed a patch implementing multivariate polynomials seen as a multi-base algebra. The patch is to be released into the software Sage and can already be found within the Sage-Combinat distribution. One can use our patch to define a polynomial in a set of indexed variables and expand it into a linear basis of the multivariate polynomials. So far, we have the Schubert polynomials, the ...
متن کاملRemovable Singularities of Ore Operators
Ore algebras are an algebraic structure used to model many different kinds of functional equations like differential and recurrence equations. The elements of an Ore algebra are polynomials for which the multiplication is defined to be usually non-commutative. As a consequence, Gauß’ lemma does not hold in many Ore polynomial rings and hence the product of two primitive Ore polynomials is not n...
متن کاملNoncommutative polynomial maps
Polynomial maps attached to polynomials of an Ore extension are naturally defined. In this setting we show the importance of pseudo-linear transformations and give some applications. In particular, factorizations of polynomials in an Ore extension over a finite field Fq[t; θ], where θ is the Frobenius automorphism, are translated into factorizations in the usual polynomial ring Fq[x].
متن کاملModular Computation for Matrices of Ore Polynomials
We give a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t]. Both the transformation matrix and the transformed matrix are computed. The algorithm can be used for finding the rank and left nullspace of such matrices. In the special case of shift polynomials, we obtain algorithms for computing a weak Popov form and for computing a greatest common...
متن کامل